#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

ll a,m;
//计算欧拉函数
ll oula(ll m){
	ll res=m;
	for(ll i=2;i*i<=m;i++){
		if(m%i==0){
			res-=res/i;
			while(m%i==0)m/=i;
		}
	}
	if(m>1)res-=res/m;
	return res;
}
/*
给你三个正整数，a,m,ba,m,b，你需要求：a^b mod m */
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	read(a);
	read(m);
	ll o=oula(m);
	ll b=0;
	char ch;
	do{ch=getchar();}while(ch<'0'||ch>'9');
	bool flg=false;
	do{
		b=b*10+ch-'0';
		if(b>o){
			flg=true;
			b%=o;
		}
		ch=getchar();
	}while(ch>='0'&&ch<='9');
	if(flg)b+=o;
	ll ans=1;
	a%=m;
	while(b){
		if(b&1)ans=(ans*a)%m;
		a=(a*a)%m;
		b>>=1;
	}
	cout<<ans<<endl;
}

